On principles of Least Change and Least Surprise for bidirectional transformations.
نویسندگان
چکیده
منابع مشابه
On principles of Least Change and Least Surprise for bidirectional transformations
In software engineering and elsewhere, different people may work intensively with different, but related, artefacts, e.g. models, documents, or code. They may use bidirectional transformations (bx) to maintain consistency between them. Naturally, they do not want their deliberate decisions disrupted, or their comprehension of their artefact interfered with, by a bx that makes changes to their a...
متن کاملTowards a Principle of Least Surprise for Bidirectional Transformations
In software engineering and elsewhere, it is common for different people to work intensively with different, but related, artefacts, e.g. models, documents, or code. They may use bidirectional transformations (bx) to maintain consistency between them. Naturally, they do not want their deliberate decisions disrupted, or their comprehension of their artefact interfered with, by a bx that makes ch...
متن کاملComposing Least-change Lenses
Non-trivial bidirectional transformations (BXs) are inherently ambiguous, as there are in general many different ways to consistently translate an update from one side to the other. Existing BX languages and frameworks typically satisfy fundamental first principles which ensure acceptable and stable (well-behaved) translation. Unfortunately, these give little insight about how a particular upda...
متن کاملOn Least Action Principles for Discrete Quantum Scales
We consider variational problems where the velocity depends on a scale. After recalling the fundamental principles that lead to classical and quantum mechanics, we study the dynamics obtained by replacing the velocity by some physical observable at a given scale into the expression of the Lagrangian function. Then, discrete Euler-Lagrange and Hamilton-Jacobi equations are derived for a continuo...
متن کاملTransformations and algorithms for least sum of squares hypersphere fitting
A problem from shape fitting is finding the sphere which has the least sum of squares fit to a set of points. Most current algorithms for this use an iterative process, with randomized restarting. We present, instead, two geometric transformations, and algorithms derived using them, which present alternate methods of solving the problem. We discuss running of these algorithms in three dimension...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Object Technology
سال: 2017
ISSN: 1660-1769
DOI: 10.5381/jot.2017.16.1.a3